A Mixed Integer Programming Approach to the Locomotive Assignment Problem Francesco Piu† Visiting PhD at the TRANSP-OR laboratory, École Polytechnique Fédérale de Lausanne,

Source URL: www.strc.ch

• Locomotive
• Train
• Rail freight transport
• Canadian National Railway
• Co-Co locomotives
• Diesel locomotive
• 4-8-4

An integrated fleet assignment and itinerary choice model for a new flexible aircraft Bilge Atasoy Matteo Salani Michel Bierlaire

Source URL: www.strc.ch

• Statistics
• Statistical models
• Economics
• Regression analysis
• Economy
• Choice modelling
• Discrete choice
• Itinerary
• Economic model
• Logit
• Logistic regression
• Parameter identification problem

An Algorithm for Computing the Restriction Scaffold Assignment Problem in Computational Biology Justin Colannino Godfried Toussaint School of Computer Science

Source URL: www-cgrl.cs.mcgill.ca

An Algorithm for Computing the Restriction Scaffold Assignment Problem in Computational Biology Justin Colannino Godfried Toussaint School of Computer Science

Source URL: cgm.cs.mcgill.ca

Name: Problem Set 1 Math 4281, Spring 2014 Due: Wednesday, January 29 Complete the following items, staple this page to the front of your work, and turn your assignment

Source URL: www-users.math.umn.edu

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem Justin Colannino Mirela Damian Ferran Hurtado John Iacono

Source URL: www-cgrl.cs.mcgill.ca

Traffic demand pattern generation for a grid network based on experiment design Qiao Ge, ETH Zurich Javier Ortigosa, ETH Zurich Monica Menendez, ETH Zurich

Source URL: www.strc.ch

• Transport
• Land transport
• Road transport
• Road traffic management
• Transportation planning
• Network flow
• Route assignment
• Traffic congestion
• Traffic simulation
• Traffic
• Maximum flow problem

The Polynomial method: Problem Set 3 Due noon, Wednesday, June 3rd You may use the following property in this assignment without proof: There does not exists an infinite chain

Source URL: www.math.caltech.edu

An O(n log n)-Time Algorithm for the Restricted Scaffold Assignment Problem Justin Colannino Mirela Damian Ferran Hurtado John Iacono

Source URL: cgm.cs.mcgill.ca

Homework Assignment — First Steps in Research Micha Sharir Problem 1 Prove L´ovasz’ Lemma: Let S be a set of n points in the plane (n even). Let G be the halving graph of S: Its edges are straight segments ab for al

Source URL: tq.cs.tau.ac.il